Concurrent operations on B∗-trees with overtaking
نویسندگان
چکیده
منابع مشابه
A Process-Calculus Analysis of Concurrent Operations on B-Trees
This paper has two primary goals. The first is to illustrate how the ?-calculus, a general theory of interactive systems with changing structure, can be used to reason rigorously about concurrent operations on data structures: a study of operations on B-trees is presented, and an improved algorithm for compression of the data structure is explained. The second aim is to show some general result...
متن کاملConcurrent B-trees with Lock-free Techniques
B-trees and their variants are efficient data structures for finding records in a large collection (e.g., databases). The efficiency of B-trees increases when a number of users can manipulate the tree simultaneously. Many algorithms have been developed over the last three decades to achieve both concurrency and consistency in B-trees. However, current lock-based concurrency-control techniques l...
متن کاملRestructuring the concurrent B+-tree with non-blocked search operations
Database systems frequently establish the B-tree style indexes for fast access to data records. Since the B-tree index could be a performance bottleneck, many concurrent algorithms have been proposed to improve concurrency of B-tree accesses. In this paper we propose a new concurrent Bþ-tree algorithm that provides high concurrency and an efficient tree restructuring method. As the proposed met...
متن کاملConcurrency Control in B+-Trees Databases Using Preparatory Operations
A simple concurrency control mechanism for B+-trees Databases is introduced. It is based on early splitting and catenating of nodes during a process, which are candidates for such operations later on in that process. These early operations enable to lock only the current node in the process and its father node, and hence to increase the degree of concurrency relatively to other known mechanisms.
متن کاملConcurrent Cache-Oblivious B-Trees Using Transactional Memory
Cache-oblivious B-trees for data sets stored in external memory represent an application that can benefit from the use of transactional memory (TM), yet pose several challenges for existing TM implementations. Using TM, a programmer can modify a serial, in-memory cache-oblivious B-tree (CO B-tree) to support concurrent operations in a straightforward manner, by performing queries and updates as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1986
ISSN: 0022-0000
DOI: 10.1016/0022-0000(86)90021-8